SIA(M)ESE: An efficient algorithm for transposition invariant pattern matching in multidimensional datasets
نویسندگان
چکیده
In this paper, we study pattern matching in multidimensional datasets. The aim is to find translation (transposition) invariant occurrences of a given query pattern, called template, in an arbitrary multidimensional dataset. Between the points in the dataset that have been found to match the consecutive points in the template, there may be any finite number of other intervening datapoints. For this task, we introduce an algorithm, called SIA(M)ESE, which is based on the SIA pattern induction algorithm (Meredith et al., prep). The algorithm is first introduced in abstract mathematical form, then we show how we have implemented it using sophisticated techniques and equipped it with sensible heuristics. The resulting efficient algorithm has a worst case running time of O(mn log(mn)), where m and n are the size of the template and the dataset, respectively. We consider several application domains, such as cognitive modeling of music and matching of polyphonic music and bitmap images, and show the flexibility of SIA(M)ESE. It not only solves the problem it is developed for, but without any change to its original time complexity, it can also simulate the working of several existing algorithms developed for distinct pattern matching problems.
منابع مشابه
SIA(M)ESE: An Algorithm for Transposition Invariant, Polyphonic Content-Based Music Retrieval SIA(M)ESE: An Algorithm for Transposition Invariant, Polyphonic Content-Based Music Retrieval
We introduce a novel algorithm for transposition-invariant contentbased polyphonic music retrieval. Our SIA(M)ESE algorithm is capable of finding transposition invariant occurrences of a given template, in a database of polyphonic music called a dataset. We allow arbitrary gapping, i.e., between musical events in the dataset that have been found to match points in the template, there may be any...
متن کاملSIA(M)ESE: An Algorithm for Transposition Invariant, Polyphonic Content-Based Music Retrieval
We introduce a novel algorithm for transposition-invariant contentbased polyphonic music retrieval. Our SIA(M)ESE algorithm is capable of finding transposition invariant occurrences of a given template, in a database of polyphonic music called a dataset. We allow arbitrary gapping, i.e., between musical events in the dataset that have been found to match points in the template, there may be any...
متن کاملPattern Induction and matching in polyphonic music and other multidimensional datasets
We present a new algorithm, SIA, which discovers maximal repeated patterns in any set of points in Cartesian spaces of any dimensionality. The worst-case running time of SIA is O(kn2 log2 n) for a k-dimensional dataset of size n. SIATEC is an extension of SIA that generates a set of translational equivalence classes (TECs). If the input represents a musical score then each TEC contains all the ...
متن کاملDPML-Risk: An Efficient Algorithm for Image Registration
Targets and objects registration and tracking in a sequence of images play an important role in various areas. One of the methods in image registration is feature-based algorithm which is accomplished in two steps. The first step includes finding features of sensed and reference images. In this step, a scale space is used to reduce the sensitivity of detected features to the scale changes. Afterw...
متن کامل